منابع مشابه
External Inverse Pattern Matching
In this paper we consider the externa//nverse pattern match/ng problem. Given a text T of length n over an ordered alphabet ,U and a number m <_ n, the goal is to find a pattern ~-~MAX ~ ~rn which is not a subword of T and which maximizes the sum of Hamming distances between ~MAX and all subwords of T of length m. We present an optimal O(nloga)-time (where a = 1/71) algorithm for the external i...
متن کاملInverse Pattern Matching
Let a textstring T of n symbols from some alphabet E and an integer m < n be given. A pattern P of length mover E is sought such that P minimizes (alternatively, maximizes) the total number of pairwise character mismatches generated when P is compared with all mcharacter substrings of T. Two additional variants of the problem are obtained by adding the constraint that P be (respectively, not be...
متن کاملPattern Matching
An important subtask of the pattern discovery process is pattern matching, where the pattern sought is already known and we want to determine how often and where it occurs in a sequence. In this paper we review the most practical techniques to find patterns of different kinds. We show how regular expressions can be searched for with general techniques, and how simpler patterns can be dealt with...
متن کاملLocal Derivative Pattern with Smart Thresholding: Local Composition Derivative Pattern for Palmprint Matching
Palmprint recognition is a new biometrics system based on physiological characteristics of the palmprint, which includes rich, stable, and unique features such as lines, points, and texture. Texture is one of the most important features extracted from low resolution images. In this paper, a new local descriptor, Local Composition Derivative Pattern (LCDP) is proposed to extract smartly stronger...
متن کاملMultidimensional Elastic Pattern Matching
In this paper, we present a theory of elastic images deformation and matching. Our theory is based on the physical theory of elastic deformation of a continuum, and is very general: it applies to matching n-dimensional images with n-dimensional templates. We derive the variational formulation of the optimal deformation problem, and the Euler-Lagrange equations to solve it. Also, we address the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algorithms
سال: 1997
ISSN: 0196-6774
DOI: 10.1006/jagm.1996.0850